Polynomially solvable cases for the maximum stable set problem
نویسندگان
چکیده
منابع مشابه
An exact algorithm for the maximum stable set problem
We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to 'real-life' problems s...
متن کاملA Lagrangian Relaxation for the Maximum Stable Set Problem
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. Some computational experiments were carried out with an effective multi-threaded implementation of our a...
متن کاملAn Augmentation Algorithm for the Maximum Weighted Stable Set Problem
Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. A concept of augmenting sequences of edge-projections is deened w.r.t. a stable set S. It is then proved the equivalence between the optimality of S and the existence of an augmenting sequence w.r.t. S. This result is then exploited to develop a new tabu-search heuristic for the MaximumStab...
متن کاملHandelman's hierarchy for the maximum stable set problem
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope can be represented as conic co...
متن کاملRobotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices
In this paper, we introduce the 1− K robotic-cell scheduling problem, whose solution can be reduced to solving a TSP on specially structured permuted Monge matrices, we call b-decomposable matrices. We also review a number of other scheduling problems which all reduce to solving TSP-s on permuted Monge matrices. We present the important insight that the TSP on b-decomposable matrices can be sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00051-e